package leetcode;

/**
 * 买卖股票最佳时机含有手续费
 */
public class Solution59 {
    public int maxProfit(int[] prices, int fee) {
        if(prices == null || prices.length == 0){
            return 0;
        }
        int len = prices.length;
        //定义dp数组
        int[][] dp = new int[len][2];
        //dp数组初始化
        dp[0][0] = -prices[0];
        for(int i = 1;i < prices.length;i++){
            dp[i][0] = Math.max(dp[i-1][0],dp[i-1][1] - prices[i]);
            dp[i][1] = Math.max(dp[i-1][1],dp[i-1][0] + prices[i] - fee);
        }
        return Math.max(dp[len - 1][0],dp[len - 1][1]);
    }
}
